naive algorithm造句

例句与造句

1. A slightly more accurate compensated version performs the full naive algorithm on the residuals.
2. A naive algorithm will search from left to right, one element at a time.
3. However, in comparison to the naive algorithm used here, both of these drawbacks are relatively minimal.
4. The naive algorithm for single linkage clustering is essentially the same as Kruskal's algorithm for minimum spanning trees.
5. Thus, research in this area has concentrated on two goals : using less space than this naive algorithm, and finding pointer algorithms that use fewer equality tests.
6. It's difficult to find naive algorithm in a sentence. 用naive algorithm造句挺难的
7. Using the ideas of Lowrance and Wagner, this naive algorithm can be improved to be O \ left ( M \ cdot N \ right ) in the worst case.
8. In the naive algorithm for agglomerative clustering, implementing a different linkage scheme may be accomplished simply by using a different formula to calculate inter-cluster distances in the algorithm ..
9. The reduction in the number of arithmetic operations however comes at the price of a somewhat reduced numerical stability, and the algorithm also requires significantly more memory compared to the naive algorithm.
10. In such cases color-out algorithms are used to come out of SSA . Naive algorithms introduce a copy along each predecessor path which caused a source of different root symbol to be put in phi than the destination of phi.
11. Strassen's algorithm works for any ring, such as plus / multiply, but not all semirings, such as min / plus or boolean algebra, where the naive algorithm still works, and so called combinatorial matrix multiplication.
12. While this is a conceptually simple operation, the computational complexity of the step can be non-trivial : a naive algorithm would scan the expression " E " for all occurrences of the free variable " x ".
13. Alternative linkage schemes include average linkage clustering-implementing a different linkage in the naive algorithm is simply a matter of using a different formula to calculate inter-cluster distances in the initial computation of the proximity matrix and in step 4 of the above algorithm.
14. In 1969, Strassen shifted his research efforts towards the analysis of algorithms with a paper on Gaussian elimination, introducing Strassen's algorithm, the first algorithm for performing matrix multiplication faster than the O ( " n " 3 ) time bound that would result from a naive algorithm.
15. If sets are implemented as sorted lists, for example, the naive algorithm for union ( " S ", " T " ) will take time proportional to the length " m " of " S " times the length " n " of " T "; whereas a variant of the union-find data structure ) that are optimized for one or more of these operations, at the expense of others.
16. When " R " is a power of a small positive integer " b ", can be computed by Hensel's lemma : The inverse of " N " modulo " b " is computed by a naive algorithm ( for instance, if then the inverse is 1 ), and Hensel's lemma is used repeatedly to find the inverse modulo higher and higher powers of " b ", stopping when the inverse modulo " R " is known; is the negation of this inverse.